Surface Mesh Projection for Hexahedral Mesh Generation by Sweeping
نویسندگان
چکیده
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection of a source surface mesh onto the target surface. This paper presents a new algorithm to map a given mesh over the source surface onto the target surface. This projection is carried out by means of a least-squares approximation of an affine mapping defined between the parametric spaces of the surfaces. Once the new mesh is obtained on the parametric space of the target surface, it is mapped up according to the target surface parameterization. Therefore, the developed algorithm does not require to solve any root finding problem to ensure that the projected nodes are on the target surface. Afterwards, this projection algorithm is extended to three dimensional cases and it is used to generate the inner layers of elements in the physical space.
منابع مشابه
A global approach to multi-axis swept mesh generation
The sweeping algorithm is a classical algorithm that can generate high quality hexahedral meshes for swept volumes. However, the traditional sweeping algorithm can only generate single axis swept meshes. In order to expand the scope of the model that sweeping algorithms are applicable to, this paper proposes a global multi-axis swept mesh generation approach, which can robustly generate hexahed...
متن کاملPii: S0010-4485(99)00040-8
The current paper presents a pseudo-sweep algorithm to determine whether a given volume constitutes an approximately swept shape for the purpose of hexahedral finite element mesh generation. The pseudo-swept shape determination approach consists of three steps. Step 1: Determining the source surface, target surface, and lateral surface of a given solid object B. Two requirements: topological an...
متن کاملAutomatic Hexahedral Mesh Generation by Recursive Convex and Swept Volume Decomposition
In this paper we present a recursive volume decomposition method for automatically decomposing complex shaped objects with both protrusions and depressions into simpler sub-objects for automatic hexahedral mesh generation. The sub-volumes after decomposition are classified into either convex or swept volumes. For a convex volume, it is mapped to a collection of hexahedral objects. On the other ...
متن کاملA Density Control Based Adaptive Hexahedral Mesh Generation Algorithm
A density control based adaptive hexahedral mesh generation algorithm for three dimensional models is presented in this paper. The first step of this algorithm is to identify the characteristic boundary of the solid model which needs to be meshed. Secondly, the refinement fields are constructed and modified according to the conformal refinement templates, and used as a metric to generate an ini...
متن کاملHexahedral mesh generation via constrained quadrilateralization
Decomposing a volume into high-quality hexahedral cells is a challenging task in finite element simulations and computer graphics. Inspired by the use of a spatial twist continuum and frame field in previous hexahedral mesh generation methods, we present a method of hexahedral mesh generation via constrained quadrilateralization that combines a spatial twist continuum and frame fields. Given a ...
متن کامل